A Discrete Particle Swarm Optimization to Estimate Parameters in Vision Tasks
نویسندگان
چکیده
منابع مشابه
Tasks Scheduling in Computational Grid using a Hybrid Discrete Particle Swarm Optimization
Computing Grid is a high performance computing environment that allows sharing of geographically distributed resources across multiple administrative domains and used to solve large scale computational demands. To achieve the promising potentials of computational grids, job scheduling is an important issue to be considered. This paper addresses scheduling problem of independent tasks on computa...
متن کاملParameters Selection in the Discrete Particle Swarm Optimization Algorithm Solving Gate and Runway Combinational Optimization Problem
Gate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance...
متن کاملMulti-phase Discrete Particle Swarm Optimization
This paper describes a successful adaptation of the Particle Swarm Optimization algorithm to discrete optimization problems. In the proposed algorithm, particles cycle through multiple phases with differing goals. We also exploit hill climbing. On benchmark problems, this algorithm outperforms a genetic algorithm and a previous discrete PSO formulation.
متن کاملChaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملDiscrete Multi-Valued Particle Swarm Optimization
We present a new optimization technique based on the Particle Swarm Optimization algorithm to be used for solving problems with unordered discrete-valued solution elements. The algorithm achieves comparable performance to both the previous modification of PSO for binary optimization and to genetic algorithms on a standard set of benchmark problems. Performance is maintained on these problems re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2016
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2016.070128